Aggregation and Interconnection of Hybrid Automata :
نویسنده
چکیده
We start by introducing a notion of hybrid automata with a clear identiication of the signature component. Hybrid automata intermix discrete and continuous behavior, extending non-deterministic automata with attributes that evolve continuously with time according to evolution laws. Adopting a categorial approach to aggregating and interconnecting hybrid automata we look at a suitable deenition of morphism and establish the category of hybrid automata. We then characterize free aggregation as a categorial product and interconnection as a cartesian lifting from signatures. This will enable us to start developing a categorial theory of compositional speciication and veriication of hybrid automata.
منابع مشابه
Categorical foundations for randomly timed automata
The general theory of randomly timed automata is developed: starting with the practical motivation and presentation of the envisaged notion, the categorical theory of minimization, aggregation, encapsulation, interconnection and realization of such automata is worked out. All these constructions are presented universally: minimization and realization as adjunctions, aggregation as product, inte...
متن کاملRealization of Probabilistic Automata: Categorial Approach
We present a categorical framework to study probabilistic automata starting by obtaining aggregation and interconnection as universal constructions. We also introduce the notion of probabilistic behavior in order to get adjunctions between probabilistic behavior and probabilistic automata. Thus we are able to extend to the probabilistic setting free and minimal realizations as universal constru...
متن کاملUniversal Aspects of Probabilistic Automata 3
For lack of composability of their morphisms, probability spaces, and hence probabilistic automata, fail to form categories; however, they t into the more general framework of precategories, which are introduced and studied here. In particular, the notion of adjunction and weak adjunction for precategories is presented and justiied in detail. As an immediate beneet, a concept of (weak) product ...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998